a multi-level capacitated lot-sizing problem with safety stock deficit and production manners: a revised simulated annealing

[1] corresponding author e-mail: [email protected]   [1] corresponding author e-mail: [email protected]   lot-sizing problems (lsps) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. this paper aims at developing a new mathematical model for the multi-level capacitated lsp with setup times, safety stock deficit, shortage, and different production manners. since the proposed linear mixed integer programming model is np-hard, a new version of simulated annealing algorithm (sa) is developed to solve the model named revised sa algorithm (rsa). since the performance of the meta-heuristics severely depends on their parameters, taguchi approach is applied to tune the parameters of both sa and rsa. in order to justify the proposed mathematical model, we utilize an exact approach to compare the results. to demonstrate the efficiency of the proposed rsa, first, some test problems are generated; then, the results are statistically and graphically compared with the traditional sa algorithm.